﻿//
// (C) Copyright 2009 Irantha Suwandarathna (iranthas@hotmail.com)
// All rights reserved.
//

/* Copyright (c) 2001-2008, The HSQL Development Group
 * All rights reserved.
 *
 * Redistribution and use _in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *
 * Redistributions of source code must retain the above copyright notice, this
 * list of conditions and the following disclaimer.
 *
 * Redistributions _in binary form must reproduce the above copyright notice,
 * this list of conditions and the following disclaimer _in the documentation
 * and/or other materials provided with the distribution.
 *
 * Neither the name of the HSQL Development Group nor the names of its
 * contributors may be used to endorse or promote products derived from this
 * software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL HSQL DEVELOPMENT GROUP, HSQLDB.ORG,
 * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading;
using EffiProz.Core.Store;

namespace EffiProz.Core.Lib
{
    public class IntKeyHashMapConcurrent : BaseHashMap
    {
        Set _keySet;
        Collection _values;

        //
        ReaderWriterLockSlim _lock = new ReaderWriterLockSlim(LockRecursionPolicy.SupportsRecursion);


        public IntKeyHashMapConcurrent()
            : this(8)
        {

        }

        public IntKeyHashMapConcurrent(int initialCapacity)
            : base(initialCapacity, BaseHashMap.intKeyOrValue,
                BaseHashMap.objectKeyOrValue, false)
        {

        }

        public Object get(int key)
        {

            try
            {
                _lock.EnterReadLock();

                int lookup = getLookup(key);

                if (lookup != -1)
                {
                    return objectValueTable[lookup];
                }

                return null;
            }
            finally
            {
                _lock.ExitReadLock();
            }
        }

        public Object put(int key, Object value)
        {

            try
            {
                _lock.EnterWriteLock();

                return base.addOrRemove(key, 0, null, value, false);
            }
            finally
            {
                _lock.ExitWriteLock();
            }
        }

        public override  bool containsValue(Object value)
        {

            try
            {
                _lock.EnterReadLock();

                return base.containsValue(value);
            }
            finally
            {
                _lock.ExitReadLock();
            }
        }

        public Object remove(int key)
        {

            try
            {
                _lock.EnterWriteLock();

                return base.addOrRemove(key, 0, null, null, true);
            }
            finally
            {
                _lock.ExitWriteLock();
            }
        }

        public override bool containsKey(int key)
        {

            try
            {
                _lock.EnterReadLock();

                return base.containsKey(key);
            }
            finally
            {
                _lock.ExitReadLock();
            }
        }

        public int getOrderedMatchCount(int[] array)
        {

            int i = 0;

            try
            {
                _lock.EnterReadLock();

                for (; i < array.Length; i++)
                {
                    if (!base.containsKey(array[i]))
                    {
                        break;
                    }
                }

                return i;
            }
            finally
            {
                _lock.ExitReadLock();
            }
        }

        public Set keySet()
        {

            if (_keySet == null)
            {
                _keySet = new KeySet(this);
            }

            return _keySet;
        }

        public Collection values()
        {

            if (_values == null)
            {
                _values = new Values(this);
            }

            return _values;
        }

        class KeySet : Set
        {

            private IntKeyHashMapConcurrent _o;

            public KeySet(IntKeyHashMapConcurrent _o)
            {
                this._o = _o;
            }

            public Iterator iterator()
            {
                return new BaseHashIterator(_o, true);
            }

            public int size()
            {
                return _o.size();
            }

            public bool contains(Object o)
            {
                throw new Exception();
            }

            public Object get(Object key)
            {
                throw new Exception();
            }

            public bool add(Object value)
            {
                throw new Exception();
            }

            public bool addAll(Collection c)
            {
                throw new Exception();
            }

            public bool remove(Object o)
            {
                throw new Exception();
            }

            public bool isEmpty()
            {
                return size() == 0;
            }

            public void clear()
            {
                _o.clear();
            }
        }

        class Values : Collection
        {


            private IntKeyHashMapConcurrent _o;

            public Values(IntKeyHashMapConcurrent _o)
            {
                this._o = _o;
            }

            public Iterator iterator()
            {
                return new BaseHashIterator(_o, false);
            }

            public int size()
            {
                return _o.size();
            }

            public bool contains(Object o)
            {
                throw new Exception();
            }

            public bool add(Object value)
            {
                throw new Exception();
            }

            public bool addAll(Collection c)
            {
                throw new Exception();
            }

            public bool remove(Object o)
            {
                throw new Exception();
            }

            public bool isEmpty()
            {
                return size() == 0;
            }

            public void clear()
            {
                _o.clear();
            }
        }
    }
}
